Privacy preserving record linkage using homomorphic encryption

نویسندگان

  • Sean M. Randall
  • Adrian P. Brown
  • Anna M. Ferrante
  • James H. Boyd
  • James B. Semmens
چکیده

The bloom filter method for privacy preserving record linkage [24] has been shown to be both efficient, and provide equivalent linkage quality to that achievable with unencoded identifiers [23]. However in some situations, the bloom filter method may be vulnerable to frequency attacks, which could potentially leak identifying information [18]. In this paper we extend the bloom filter protocol to include a homomorphic encryption step which removes the vulnerability to frequency attacks. We evaluate our method by conducting a de-duplication of emergency presentation data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Privacy Preserving Probabilistic Record Linkage (P3RL): a novel method for linking existing health-related data and maintaining participant confidentiality

BACKGROUND Record linkage of existing individual health care data is an efficient way to answer important epidemiological research questions. Reuse of individual health-related data faces several problems: Either a unique personal identifier, like social security number, is not available or non-unique person identifiable information, like names, are privacy protected and cannot be accessed. A s...

متن کامل

Privacy-Preserving Clustering Using Representatives over Arbitrarily Partitioned Data∗

The challenge in privacy-preserving data mining is avoiding the invasion of personal data privacy. Secure computation provides a solution to this problem. With the development of this technique, fully homomorphic encryption has been realized after decades of research; this encryption enables the computing and obtaining results via encrypted data without accessing any plaintext or private key in...

متن کامل

Privacy Preserving using Homomorphic Encryption

In the recent time, privacy preserving has been studied extensively, because of the extensive explosion of sensitive information. Privacy preserving is one of the important areas that aim to provide security for secret information from unsolicited or unsanctioned disclosure. This has triggered the development of much privacy preserving technique using encryption algorithm. This work will presen...

متن کامل

Preserving Privacy of Cloud Data Using Homomorphic Encryption in MapReduce

In recent years, outsourcing large amount of data in cloud and how to manage the data raises many challenges with respect to privacy. The concerns of privacy can be addressed if cloud users encrypt the data deployed in the cloud. Among the various cryptographic encryption schemes, homomorphic scheme allow to perform meaningful computations on encrypted data. In this context, the research deals ...

متن کامل

Privacy Preserving PageRank Algorithm By Using Secure Multi-Party Computation

In this work, we study the problem of privacy preserving computation on PageRank algorithm. The idea is to enforce the secure multi party computation of the algorithm iteratively using homomorphic encryption based on Paillier scheme. In the proposed PageRank computation, a user encrypt its own graph data using asymmetric encryption method, sends the data set into different parties in a privacy-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015